Symmetry Group of Ordered Hamming Block Space
نویسندگان
چکیده
Let P = ({1, 2, . . . , n,≤) be a poset that is an union of disjoint chains of the same length and V = Fq be the space of N -tuples over the finite field Fq. Let Vi = F ki q , 1 ≤ i ≤ n, be a family of finitedimensional linear spaces such that k1 + k2 + . . . + kn = N and let V = V1⊕V2⊕ . . .⊕Vn endow with the poset block metric d(P,π) induced by the poset P and the partition π = (k1, k2, . . . , kn), encompassing both Niederreiter-Rosenbloom-Tsfasman metric and error-block metric. In this paper, we give a complete description of group of symmetries of the metric space (V, d(P,π)), called the ordered Hammming block space. In particular, we reobtain the group of symmetries of the NiederreiterRosenbloom-Tsfasman space and obtain the group of symmetries of the error-block metric space.
منابع مشابه
Title of dissertation : BOUNDS ON THE SIZE OF CODES
Title of dissertation: BOUNDS ON THE SIZE OF CODES Punarbasu Purkayastha Doctor of Philosophy, 2010 Dissertation directed by: Professor Alexander Barg Department of Electrical and Computer Engineering and The Institute for Systems Research In this dissertation we determine new bounds and properties of codes in three different finite metric spaces, namely the ordered Hamming space, the binary Ha...
متن کاملar X iv : c s / 07 02 03 3 v 2 [ cs . I T ] 2 2 O ct 2 00 8 BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by the multivariate Krawtchouk polynomials, and establish some of their properties. CONTENTS
متن کاملcs . I T ] 5 F eb 2 00 7 BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by the multivariable Krawtchouk polynomials, and establish some of their properties.
متن کاملUpper bounds for ternary constant weight codes from semidefinite programming and representation theory
In this thesis we use a semidefinite programming approach to find explicit upper bounds on the size of ternary constant weight codes with prescribed minimum distance d. By constructing a graph Γ = (X,E), on the set, X, of all possible ternary words of weight w letting {x, y} ∈ E ⇔ 0 < dH(x, y) < d, we can view this problem as a special case of the stable set problem. Using symmetry, the constra...
متن کاملBlock coset codes for M-ary phase shift keying
Aktract-Construction of efficient block-encoded M-ary phase shift keying (M-PSK) schemes is investigated in this paper. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of linear codes are investigated. From this analysis, a class of codes ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.09987 شماره
صفحات -
تاریخ انتشار 2017